全文获取类型
收费全文 | 32879篇 |
免费 | 3111篇 |
国内免费 | 1647篇 |
专业分类
电工技术 | 3876篇 |
技术理论 | 2篇 |
综合类 | 3149篇 |
化学工业 | 3018篇 |
金属工艺 | 2035篇 |
机械仪表 | 4284篇 |
建筑科学 | 1197篇 |
矿业工程 | 1498篇 |
能源动力 | 1537篇 |
轻工业 | 2152篇 |
水利工程 | 446篇 |
石油天然气 | 827篇 |
武器工业 | 416篇 |
无线电 | 2520篇 |
一般工业技术 | 3680篇 |
冶金工业 | 1737篇 |
原子能技术 | 158篇 |
自动化技术 | 5105篇 |
出版年
2024年 | 83篇 |
2023年 | 380篇 |
2022年 | 719篇 |
2021年 | 897篇 |
2020年 | 1061篇 |
2019年 | 775篇 |
2018年 | 841篇 |
2017年 | 1036篇 |
2016年 | 1171篇 |
2015年 | 1306篇 |
2014年 | 2083篇 |
2013年 | 2124篇 |
2012年 | 2450篇 |
2011年 | 2543篇 |
2010年 | 1803篇 |
2009年 | 1884篇 |
2008年 | 1727篇 |
2007年 | 2247篇 |
2006年 | 2013篇 |
2005年 | 1786篇 |
2004年 | 1442篇 |
2003年 | 1372篇 |
2002年 | 1089篇 |
2001年 | 998篇 |
2000年 | 809篇 |
1999年 | 658篇 |
1998年 | 451篇 |
1997年 | 409篇 |
1996年 | 307篇 |
1995年 | 254篇 |
1994年 | 216篇 |
1993年 | 138篇 |
1992年 | 128篇 |
1991年 | 89篇 |
1990年 | 74篇 |
1989年 | 75篇 |
1988年 | 43篇 |
1987年 | 34篇 |
1986年 | 15篇 |
1985年 | 24篇 |
1984年 | 20篇 |
1983年 | 14篇 |
1982年 | 11篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1964年 | 3篇 |
1962年 | 5篇 |
1956年 | 2篇 |
1955年 | 2篇 |
1954年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
991.
992.
为了克服传统串级调速系统功率因数低的缺点 ,提出了一种新型斩波式串级调速方案。该方案中的逆变电压与逆变电流的夹角可以在 15 0°与 180°之间变动 ,有效地提高了串级调速系统的功率因数 相似文献
993.
结合过程企业的特点 ,采用先进的网络技术和软件开发技术 ,开展了供应链管理监控系统研究 ,提出了适合过程企业的供应链监控系统结构框架 ,并在企业供应链系统网络环境下进行了开发应用研究。 相似文献
994.
995.
该论文分析了供应链管理系统的结构和用户特征,提出了对此系统应用安全框架要求:管理的方便性、数据的机密性和数据的完整性。然后从类关系图的角度总体设计了此应用框架,在传统RBAC模型中角色的基础上增加关联角色的概念,使得RBAC模型更加灵活,另外还进行角色的可扩展性设计和数据的保密设计,并实现了系统的功能。最后通过集团公司的试用结果来证实了设计的可行性。 相似文献
996.
997.
Predictive modelling of online dynamic user-interaction recordings and community identification from such data becomes more
and more important with the widespread use of online communication technologies. Despite of the time-dependent nature of the
problem, existing approaches of community identification are based on static or fully observed network connections. Here we
present a new, dynamic generative model for the inference of communities from a sequence of temporal events produced through
online computer- mediated interactions. The distinctive feature of our approach is that it tries to model the process in a
more realistic manner, including an account for possible random temporal delays between the intended connections. The inference
of these delays from the data then forms an integral part of our state-clustering methodology, so that the most likely communities
are found on the basis of the likely intended connections rather than just the observed ones. We derive a maximum likelihood
estimation algorithm for the identification of our model, which turns out to be computationally efficient for the analysis
of historical data and it scales linearly with the number of non-zero observed (L + 1)-grams, where L is the Markov memory length. In addition, we also derive an incremental version of the algorithm, which could be used for
real-time analysis. Results obtained on both synthetic and real-world data sets demonstrate the approach is flexible and able
to reveal novel and insightful structural aspects of online interactions. In particular, the analysis of a full day worth
synchronous Internet relay chat participation sequence, reveals the formation of an extremely clear community structure. 相似文献
998.
Branch query processing is a core operation of XML query processing. In recent years, a number of stack based twig join algorithms
have been proposed to process twig queries based on tag stream index. However, in tag stream index, each element is labeled
separately without considering the similarity among elements. Besides, algorithms based on tag stream index perform inefficiently
on large document. This paper proposes a novel index, named Clustered Chain Path Index, based on a novel labeling scheme.
This index provides efficient support for processing branch queries. It also has the same cardinality as 1-index against tree
structured XML document. Based on CCPI, efficient algorithms, KMP-Match-Path and Related-Path-Segment-Join, are proposed to
process queries efficiently. Analysis and experimental results show that proposed query processing algorithms based on CCPI
outperform other algorithms and have good scalability.
This paper is partially supported by Natural Science Foundation of Heilongjiang Province, Grant No. zjg03-05 and National
Natural Science Foundation of China, Grant No. 60473075 and Key Program of the National Natural Science Foundation of China,
Grant No. 60533110. 相似文献
999.
Kunsoo Han Robert J. Kauffman Barrie R. Nault 《Information Technology and Management》2008,9(3):181-200
Implementation and maintenance of interorganizational systems (IOS) require investments by all the participating firms. Compared
with intraorganizational systems, however, there are additional uncertainties and risks. This is because the benefits of IOS
investment depend not only on a firm’s own decisions, but also on those of its business partners. Without appropriate levels
of investment by all the firms participating in an IOS, they cannot reap the full benefits. Drawing upon the literature in
institutional economics, we examine IOS ownership as a means to induce value-maximizing noncontractible investments. We model
the impact of two factors derived from the theory of incomplete contracts and transaction cost economics: relative importance
of investments and specificity of investments. We apply the model to a vendor-managed inventory system (VMI) in a supply chain
setting. We show that when the specificity of investments is high, this is a more critical determinant of optimal ownership
structure than the relative importance of investments. As technologies used in IOS become increasingly redeployable and reusable,
and less specific, the relative importance of investments becomes a dominant factor. We also show that the bargaining mechanism—or
the agreed upon approach to splitting the incremental payoffs—that is used affects the relationship between these factors
in determining the optimal ownership structure of an IOS.
相似文献
Barrie R. NaultEmail: |
1000.
With the availability of low-cost radio frequency identification (RFID) tags, security becomes an increasing concern.However, such tags do not permit complex eryptographic functions due to their computational, communications, and storage limitations.In this paper, we investigate the security issues and requirements of RFID systems, and propose ultra-light weight and light weight protocols for low-cost RFID tags. The proposed protocols has been applied to a supply chain management system. 相似文献